ROUTING ALGORITHMS UNDER MUTUAL INTERFERENCE CONSTRAINTS
نویسندگان
چکیده
منابع مشابه
Gathering Algorithms on Paths Under Interference Constraints
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-determined destination node under interference constraints which are modeled by an integer d ≥ 1, so that any node within distance d of a sender cannot receive calls from any other sender. A set of calls which do not interfere with each other is referred to as a round. We give algorithms and low...
متن کاملAlgorithms for Routing with Multiple Constraints
In this paper, we study the problem of routing under multiple constraints. We consider a graph where each edge is labeled with a cost and a delay. We then consider the problem of finding a path from a source vertex to a destination vertex such that the sum of the costs on the path satisfy the cost constraint and the sum of the delays satisfy the delay constraint. We present three different algo...
متن کاملMulti-robot routing under connectivity constraints
This paper addresses the problem of routing multiple range constrained robots to service spatially distributed requests at specified time instants, while ensuring a connected information exchange network at all times. We discuss the feasibility aspects of such a connectivity constrained routing problem. In particular, we derive the minimum number of robots required to service such requests, and...
متن کاملAlgorithms for Static and Dynamic Group Multicast Routing Under Bandwidth Constraints
Multicast routing allows network sources to use network resources efficiently by sending only a single copy of data to all group members. In the group multicast routing problem (GMRP), every member of a group is also a source node. The routing algorithm must construct a source-based routing tree for each member of the group which spans all other member nodes without exceeding the capacities of ...
متن کاملRecent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
This paper provides a review of the recent developments that had a major impact on the current state-ofthe-art exact algorithms for the vehicle routing problem (VRP). The paper reviews mathematical formulations, relaxations and recent exact methods for two of the most important variants of the VRP: the capacitated VRP (CVRP) and the VRP with time windows (VRPTW). The paper also reports a compar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 2015
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.58.209